<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>bfsNet: Fichero Fuente /Users/nicolunacba/Development/Dinic/trunk/network/list.c</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- Generado por Doxygen 1.7.4 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Buscar');
--></script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="bfs-small.png"/></td>
  <td style="padding-left: 0.5em;">
   <div id="projectname">bfsNet&#160;<span id="projectnumber">1.0</span></div>
   <div id="projectbrief">Algoritmo BFS para encontrar un camino de fuente a destino en una Network</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Página&#160;principal</span></a></li>
      <li><a href="annotated.html"><span>Estructuras&#160;de&#160;Datos</span></a></li>
      <li class="current"><a href="files.html"><span>Archivos</span></a></li>
      <li id="searchli">
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Buscar" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>Lista&#160;de&#160;archivos</span></a></li>
      <li><a href="globals.html"><span>Globales</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('list_8c.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">/Users/nicolunacba/Development/Dinic/trunk/network/list.c</div>  </div>
</div>
<div class="contents">
<a href="list_8c.html">Ir a la documentación de este archivo.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor"># include &lt;stdlib.h&gt;</span>
<a name="l00002"></a>00002 <span class="preprocessor"># include &lt;stdio.h&gt;</span>
<a name="l00003"></a>00003 <span class="preprocessor"># include &lt;string.h&gt;</span>
<a name="l00004"></a>00004 <span class="preprocessor"># include &lt;assert.h&gt;</span>
<a name="l00005"></a>00005 <span class="preprocessor"># include &quot;<a class="code" href="list_8h.html">list.h</a>&quot;</span>
<a name="l00006"></a>00006 <span class="preprocessor"># include &quot;<a class="code" href="tuple_8h.html">tuple.h</a>&quot;</span>
<a name="l00007"></a>00007 
<a name="l00008"></a>00008 <span class="comment">/* Estructura de un Nodo */</span>
<a name="l00009"></a><a class="code" href="structs_node.html">00009</a> <span class="keyword">struct </span><a class="code" href="structs_node.html">sNode</a>
<a name="l00010"></a>00010 {
<a name="l00012"></a><a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">00012</a>     <a class="code" href="structs_node.html">celda</a> <a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00014"></a><a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">00014</a>     <a class="code" href="structs_tuple.html">Tuple</a> <a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a>;
<a name="l00015"></a>00015 };
<a name="l00016"></a>00016 
<a name="l00017"></a>00017 <span class="comment">/* Estructura de una Lista de Nodos */</span>
<a name="l00018"></a><a class="code" href="structs_list.html">00018</a> <span class="keyword">struct </span><a class="code" href="structs_list.html">sList</a>
<a name="l00019"></a>00019 {
<a name="l00021"></a><a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">00021</a>     <a class="code" href="structs_node.html">celda</a> <a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a>;
<a name="l00023"></a><a class="code" href="structs_list.html#ad0ef7e1b5e8b52fff027720e57bebf03">00023</a>     <a class="code" href="structs_node.html">celda</a> <a class="code" href="structs_list.html#ad0ef7e1b5e8b52fff027720e57bebf03">last</a>;
<a name="l00025"></a><a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">00025</a>     <span class="keywordtype">int</span> <a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a>;
<a name="l00026"></a>00026 };
<a name="l00027"></a>00027 
<a name="l00029"></a><a class="code" href="list_8h.html#a92bbfe84653d1fedb6e463414d7bb109">00029</a> <a class="code" href="structs_list.html">List</a> <a class="code" href="list_8c.html#a92bbfe84653d1fedb6e463414d7bb109">list_create</a> (<span class="keywordtype">void</span>){
<a name="l00030"></a>00030     <a class="code" href="structs_list.html">List</a> newList = NULL;
<a name="l00031"></a>00031     
<a name="l00032"></a>00032     newList = (<a class="code" href="list_8h.html#a03163390d1f091ca251b73684ac0d22a">List</a>) malloc (<span class="keyword">sizeof</span> (<span class="keyword">struct</span> <a class="code" href="structs_list.html">sList</a>));
<a name="l00033"></a>00033     <span class="keywordflow">if</span> (newList != NULL){
<a name="l00034"></a>00034         newList-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a> = NULL;
<a name="l00035"></a>00035         newList-&gt;<a class="code" href="structs_list.html#ad0ef7e1b5e8b52fff027720e57bebf03">last</a> = NULL;
<a name="l00036"></a>00036         newList-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> = 0;
<a name="l00037"></a>00037     }
<a name="l00038"></a>00038     
<a name="l00039"></a>00039     <span class="keywordflow">return</span> newList;
<a name="l00040"></a>00040 }
<a name="l00041"></a>00041 
<a name="l00043"></a><a class="code" href="list_8h.html#a56a64bdb02666e3a7ab1a64cb37c09b5">00043</a> <span class="keywordtype">bool</span> <a class="code" href="list_8c.html#a56a64bdb02666e3a7ab1a64cb37c09b5">list_is_empty</a> (<a class="code" href="structs_list.html">List</a> l){
<a name="l00044"></a>00044     <span class="keywordtype">bool</span> b = <span class="keyword">false</span>;
<a name="l00045"></a>00045 
<a name="l00046"></a>00046     assert (l);
<a name="l00047"></a>00047 
<a name="l00048"></a>00048     <span class="keywordflow">if</span>(l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> == 0) b = <span class="keyword">true</span>;
<a name="l00049"></a>00049 
<a name="l00050"></a>00050     <span class="keywordflow">return</span> b;
<a name="l00051"></a>00051 }
<a name="l00052"></a>00052 
<a name="l00054"></a><a class="code" href="list_8h.html#a9488cf0bffafdf9a10b591b465b47743">00054</a> <span class="keywordtype">bool</span> <a class="code" href="list_8c.html#a9488cf0bffafdf9a10b591b465b47743">list_exists_elem</a> (<a class="code" href="structs_list.html">List</a> l, <a class="code" href="structs_tuple.html">elem</a> e){
<a name="l00055"></a>00055     <a class="code" href="structs_node.html">celda</a> currentNode;
<a name="l00056"></a>00056     <span class="keywordtype">bool</span> exists = <span class="keyword">false</span>;
<a name="l00057"></a>00057 
<a name="l00058"></a>00058     assert (l);
<a name="l00059"></a>00059     assert (e);
<a name="l00060"></a>00060 
<a name="l00061"></a>00061     <span class="keywordflow">if</span> (!<a class="code" href="list_8c.html#a56a64bdb02666e3a7ab1a64cb37c09b5">list_is_empty</a> (l)){
<a name="l00062"></a>00062         currentNode = l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a>;
<a name="l00063"></a>00063         <span class="comment">/* exists = tuple_compare (e, currentNode-&gt;data); */</span>
<a name="l00064"></a>00064 
<a name="l00065"></a>00065         <span class="keywordflow">while</span>((!exists) &amp;&amp; (currentNode != NULL)){
<a name="l00066"></a>00066             exists = <a class="code" href="tuple_8c.html#af6fa1108be143014167c12ce83131a00">tuple_compare</a> (e, currentNode-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a>);
<a name="l00067"></a>00067             currentNode = currentNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00068"></a>00068         }
<a name="l00069"></a>00069     }
<a name="l00070"></a>00070 
<a name="l00071"></a>00071     <span class="keywordflow">return</span> exists;
<a name="l00072"></a>00072 }
<a name="l00073"></a>00073 
<a name="l00075"></a><a class="code" href="list_8h.html#a563fa4772b82dd3c2c0f4927bcfcff8a">00075</a> <a class="code" href="structs_list.html">List</a> <a class="code" href="list_8c.html#a563fa4772b82dd3c2c0f4927bcfcff8a">list_add_new_elem</a> (<a class="code" href="structs_list.html">List</a> l, <a class="code" href="structs_tuple.html">elem</a> e){
<a name="l00076"></a>00076     <a class="code" href="structs_node.html">celda</a> newNode; 
<a name="l00077"></a>00077     
<a name="l00078"></a>00078     assert (l);
<a name="l00079"></a>00079     assert (e);
<a name="l00080"></a>00080 
<a name="l00081"></a>00081     newNode = (<a class="code" href="list_8h.html#a1d5a244e4cb73f5bbdcdbcb1cafac2a8">celda</a>) malloc (<span class="keyword">sizeof</span> (<span class="keyword">struct</span> <a class="code" href="structs_node.html">sNode</a>));
<a name="l00082"></a>00082     <span class="keywordflow">if</span>(newNode != NULL){
<a name="l00083"></a>00083         newNode-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a> = <a class="code" href="tuple_8c.html#af3404883658f7b96d761a197eb73b625">tuple_clone</a>(e);
<a name="l00084"></a>00084         newNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a> = NULL;
<a name="l00085"></a>00085 
<a name="l00086"></a>00086         <span class="keywordflow">if</span> (l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a> == NULL) {
<a name="l00087"></a>00087             l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a> = newNode;
<a name="l00088"></a>00088             l-&gt;<a class="code" href="structs_list.html#ad0ef7e1b5e8b52fff027720e57bebf03">last</a> = newNode;
<a name="l00089"></a>00089             l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> = 1;
<a name="l00090"></a>00090         } <span class="keywordflow">else</span> {
<a name="l00091"></a>00091             l-&gt;<a class="code" href="structs_list.html#ad0ef7e1b5e8b52fff027720e57bebf03">last</a>-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a> = newNode;
<a name="l00092"></a>00092             l-&gt;<a class="code" href="structs_list.html#ad0ef7e1b5e8b52fff027720e57bebf03">last</a> = newNode;
<a name="l00093"></a>00093             l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> ++;
<a name="l00094"></a>00094         }
<a name="l00095"></a>00095     }
<a name="l00096"></a>00096     <span class="keywordflow">return</span> l;
<a name="l00097"></a>00097 }
<a name="l00098"></a>00098 
<a name="l00100"></a><a class="code" href="list_8h.html#ac717ae40c94d5cb0fdbe46e08f2c639e">00100</a> <span class="keywordtype">int</span> <a class="code" href="list_8c.html#ac717ae40c94d5cb0fdbe46e08f2c639e">list_get_size</a> (<a class="code" href="structs_list.html">List</a> l){
<a name="l00101"></a>00101     assert(l);
<a name="l00102"></a>00102     <span class="keywordflow">return</span> l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a>;
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104 
<a name="l00106"></a><a class="code" href="list_8h.html#a70b22370b67357786efde98fad8aa75c">00106</a> <a class="code" href="structs_list.html">List</a> <a class="code" href="list_8c.html#a70b22370b67357786efde98fad8aa75c">list_destroy_elem</a> (<a class="code" href="structs_list.html">List</a> l, <a class="code" href="structs_tuple.html">elem</a> e){
<a name="l00107"></a>00107     <a class="code" href="structs_node.html">celda</a> currentNode = NULL, p = NULL;
<a name="l00108"></a>00108     <span class="comment">/* bool exists = false; */</span>
<a name="l00109"></a>00109 
<a name="l00110"></a>00110     assert (l);
<a name="l00111"></a>00111     assert (e);
<a name="l00112"></a>00112 
<a name="l00113"></a>00113     <span class="keywordflow">if</span> ((!<a class="code" href="list_8c.html#a56a64bdb02666e3a7ab1a64cb37c09b5">list_is_empty</a> (l)) &amp;&amp; (<a class="code" href="list_8c.html#a9488cf0bffafdf9a10b591b465b47743">list_exists_elem</a>(l,e))){
<a name="l00114"></a>00114         currentNode = l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a>;
<a name="l00115"></a>00115       
<a name="l00116"></a>00116         <span class="keywordflow">if</span> (<a class="code" href="tuple_8c.html#af6fa1108be143014167c12ce83131a00">tuple_compare</a> (e, currentNode-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a>)){
<a name="l00117"></a>00117             l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a> = l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a>-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00118"></a>00118             currentNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a> = NULL;
<a name="l00119"></a>00119             currentNode-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a> = <a class="code" href="tuple_8c.html#af8c1a0758eeec0c5b89e0ddd9ea7cf52">tuple_destroy</a> (currentNode-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a>);
<a name="l00120"></a>00120             free (currentNode);
<a name="l00121"></a>00121         } <span class="keywordflow">else</span> {
<a name="l00122"></a>00122             <span class="keywordflow">while</span> (!<a class="code" href="tuple_8c.html#af6fa1108be143014167c12ce83131a00">tuple_compare</a> (e,currentNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a>)){
<a name="l00123"></a>00123                 currentNode = currentNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00124"></a>00124             }
<a name="l00125"></a>00125             
<a name="l00126"></a>00126             p = currentNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00127"></a>00127             currentNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a> = currentNode-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00128"></a>00128             p-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a> = NULL;
<a name="l00129"></a>00129             p-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a> = <a class="code" href="tuple_8c.html#af8c1a0758eeec0c5b89e0ddd9ea7cf52">tuple_destroy</a> (p-&gt;tup);
<a name="l00130"></a>00130             free (p);
<a name="l00131"></a>00131         }
<a name="l00132"></a>00132         
<a name="l00133"></a>00133         l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> = l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a>-1;
<a name="l00134"></a>00134     }
<a name="l00135"></a>00135 
<a name="l00136"></a>00136     <span class="keywordflow">return</span> l;
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138 
<a name="l00139"></a>00139 <span class="comment">/* Elimina un elemento de la lista segun su posicion </span>
<a name="l00140"></a>00140 <span class="comment">List list_destroy_elem_by_p (List l, int position){</span>
<a name="l00141"></a>00141 <span class="comment">   Node * currentNode = NULL;</span>
<a name="l00142"></a>00142 <span class="comment">   </span>
<a name="l00143"></a>00143 <span class="comment">   assert (l);</span>
<a name="l00144"></a>00144 <span class="comment">   </span>
<a name="l00145"></a>00145 <span class="comment">   if(list_get_size(l) &gt;= position ){</span>
<a name="l00146"></a>00146 <span class="comment">       l-&gt;first = currentNode;</span>
<a name="l00147"></a>00147 <span class="comment">       </span>
<a name="l00148"></a>00148 <span class="comment">   }</span>
<a name="l00149"></a>00149 <span class="comment">   </span>
<a name="l00150"></a>00150 <span class="comment">   return l;</span>
<a name="l00151"></a>00151 <span class="comment">}*/</span>
<a name="l00152"></a>00152 
<a name="l00154"></a><a class="code" href="list_8h.html#a485ab244d725fddf0f2bc2e263250756">00154</a> <a class="code" href="structs_tuple.html">elem</a> <a class="code" href="list_8c.html#a485ab244d725fddf0f2bc2e263250756">list_get_elem</a> (<a class="code" href="structs_list.html">List</a> l, <span class="keywordtype">long</span> <span class="keywordtype">int</span> position){
<a name="l00155"></a>00155    <a class="code" href="structs_tuple.html">elem</a> e = NULL;
<a name="l00156"></a>00156    <a class="code" href="structs_node.html">celda</a> c = NULL;
<a name="l00157"></a>00157    <span class="keywordtype">long</span> <span class="keywordtype">int</span> i=1;
<a name="l00158"></a>00158    
<a name="l00159"></a>00159    <span class="keywordflow">if</span>(position&lt;=<a class="code" href="list_8c.html#ac717ae40c94d5cb0fdbe46e08f2c639e">list_get_size</a>(l)){
<a name="l00160"></a>00160        c = l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a>;
<a name="l00161"></a>00161        
<a name="l00162"></a>00162        <span class="keywordflow">while</span>(i&lt;=(position-1)){
<a name="l00163"></a>00163            c = c-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00164"></a>00164            i++;
<a name="l00165"></a>00165        }
<a name="l00166"></a>00166        
<a name="l00167"></a>00167        e = <a class="code" href="tuple_8c.html#af3404883658f7b96d761a197eb73b625">tuple_clone</a> (c-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a>);
<a name="l00168"></a>00168    }
<a name="l00169"></a>00169 
<a name="l00170"></a>00170     <span class="keywordflow">return</span> e;
<a name="l00171"></a>00171 }
<a name="l00172"></a>00172 
<a name="l00174"></a><a class="code" href="list_8h.html#afb09d6d07cbb6e7ae2318a0aa4f6e875">00174</a> <span class="keywordtype">void</span> <a class="code" href="list_8c.html#afb09d6d07cbb6e7ae2318a0aa4f6e875">list_destroy</a> (<a class="code" href="structs_list.html">List</a> l){
<a name="l00175"></a>00175    <a class="code" href="structs_node.html">celda</a> p=NULL;
<a name="l00176"></a>00176    
<a name="l00177"></a>00177    assert (l);
<a name="l00178"></a>00178    
<a name="l00179"></a>00179    <span class="keywordflow">if</span>(!<a class="code" href="list_8c.html#a56a64bdb02666e3a7ab1a64cb37c09b5">list_is_empty</a> (l)){
<a name="l00180"></a>00180        l-&gt;<a class="code" href="structs_list.html#ad0ef7e1b5e8b52fff027720e57bebf03">last</a> = NULL;
<a name="l00181"></a>00181        
<a name="l00182"></a>00182        <span class="keywordflow">while</span> (l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> != 0){
<a name="l00183"></a>00183            p = l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a>;
<a name="l00184"></a>00184            l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a> = l-&gt;<a class="code" href="structs_list.html#ad06fc76bf7013278d70a5c668aa29de5">first</a>-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a>;
<a name="l00185"></a>00185            p-&gt;<a class="code" href="structs_node.html#a565de7365cb7dce7aedc47a08a888d87">next</a> = NULL;
<a name="l00186"></a>00186            
<a name="l00187"></a>00187            p-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a> = <a class="code" href="tuple_8c.html#af8c1a0758eeec0c5b89e0ddd9ea7cf52">tuple_destroy</a> (p-&gt;<a class="code" href="structs_node.html#a113b56e5ef905be5322e2fa3905b9575">tup</a>);
<a name="l00188"></a>00188            free(p);
<a name="l00189"></a>00189            
<a name="l00190"></a>00190            l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> = l-&gt;<a class="code" href="structs_list.html#a439227feff9d7f55384e8780cfc2eb82">size</a> -1;
<a name="l00191"></a>00191        }
<a name="l00192"></a>00192    }
<a name="l00193"></a>00193    
<a name="l00194"></a>00194    free(l);
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196 
</pre></div></div>
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><a class="el" href="list_8c.html">list.c</a>      </li>
      <li class="footer">Generado el Miércoles, 13 de Abril de 2011 20:34:14 para bfsNet por&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>Todo</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Estructuras de Datos</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Archivos</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Funciones</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>&apos;typedefs&apos;</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>&apos;defines&apos;</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>


</body>
</html>
